Minmax Recurrences in Analysis of Algorithms
نویسندگان
چکیده
Recurrence relations with minimization and maximization, called minmax recurrence relations are commonly encountered in the analysis of algorithms. In this paper we present the solution of one such challenging recurrence relation. We characterize the optimal partition sizes as well as derive the order of complexity of the overall recurrence relation. It is proved that ad hoc equal partitioning is never the optimal choice. We also provide a survey of three other interesting minmax recurrence relations found in the literature.
منابع مشابه
Weighted Minmax Algorithm for Color Image Quantization
The maximum intercluster distance and the maximum quantization error that are minimized by the MinMax algorithm are shown to be inappropriate error measures for color image quantization. A fast and effective (improves image quality) method for generalizing activity weighting to any histogram-based color quantization algorithm is presented. A new non-hierarchical color quantization technique cal...
متن کاملSensor Placement for Microseismic Event Location
Mining operations can produce highly localized, low intensity earthquakes that are referred to as microseismic events. Monitoring of microseismic events is useful in predicting and comprehending hazards, and in evaluating the overall performance of a mine design. A robust localization algorithm is used to estimate the source position of the microseismic event by selecting the hypothesized sourc...
متن کاملImproved MinMax Cut Graph Clustering with Nonnegative Relaxation
In graph clustering methods, MinMax Cut tends to provide more balanced clusters as compared to Ratio Cut and Normalized Cut. The traditional approach used spectral relaxation to solve the graph cut problem. The main disadvantage of this approach is that the obtained spectral solution has mixed signs, which could severely deviate from the true solution and have to resort to other clustering meth...
متن کاملOn DC optimization algorithms for solving minmax flow problems
We formulate minmax flow problems as a DC. optimization problem. We then apply a DC. primal-dual algorithm to solve the resulting problem. The obtained computational results show that the proposed algorithm is efficient thanks to particular structures of the minmax flow problems.
متن کاملA Review of the Minimum Maximum Criterion for Optimal Bit Allocation Among Dependent Quantizers
In this paper, we review a general framework for the optimal bit allocation among dependent quantizers based on the minimum maximum (MINMAX) distortion criterion. Pros and cons of this optimization criterion are discussed and compared to the well-known Lagrange multiplier method for the minimum average (MINAVE) distortion criterion. We argue that, in many applications, the MINMAX criterion is m...
متن کامل